#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <set>
#include "tree.h"

using namespace std;
typedef pair<Tree *, int> PTI;

    int minDepth(Tree *root) {
        if (!root) return 0;
        queue<PTI> q;
        q.push(PTI(root, 1));
        while(!q.empty()) {
	    PTI front = q.front();
	    q.pop();
            if (front.first->left == NULL && front.first->right == NULL) return front.second;
            if (front.first->left) q.push(PTI(front.first->left, front.second+1));
            if (front.first->right) q.push(PTI(front.first->right, front.second+1));
        }
        return 0;
    }


int main(int argc, char **argv)
{
    int input[] = {21,7,5,6,3,2,1,4,6,23,43,54,12,54,8,10,11,35,56};
    //int input[] = {7};
    Tree *root = NULL, *root2 = NULL;
    int result;

    for (int i = 0; i < sizeof(input)/sizeof(int); i++) {
        TreeInsert(root, input[i]);
    }

    print_ascii_tree(root);

    result = minDepth(root);
    cout <<"Min Width of the tree is " << result << endl;
}
